Periodic unification
نویسندگان
چکیده
منابع مشابه
Unification and Default Unification
Unification of (typed) feature structures is an important tool for capturing linguistic generalizations. It is the core of a family of linguistic formalisms, it has been applied in phonology, morphology, syntax, and semantics, and is dominant in most linguistically informed work in natural language processing. Unification monotonically merges information. Default unification provides a non-mono...
متن کاملUnification without Unification
The logarithmic running of the gauge couplings α1, α2 and α3, indicates that they may unify at some scale MGUT ∼ 10 GeV. This is often taken to imply that the standard model gauge group is embedded into some larger simple group in which quarks and leptons are placed in the same multiplet. These models have generic features, such as proton decay, and generic problems, namely the splitting of the...
متن کاملSequential fractional differential equations and unification of anti-periodic and multi-point boundary conditions
In this paper, we present a novel idea of unification of anti-periodic and multi-point boundary conditions and develop the existence theory for sequential fractional differential equations supplemented with these new conditions. We apply fixed point theorems due to Banach, Krasnoselskii, Leray-Schauder alternative criterion, and Leray-Schauder degree theory to obtain the desired results. Our re...
متن کاملUnification Beyond GUTs : Gauge - Yukawa Unification ∗
Gauge-Yukawa Unification (GYU) is a renormalization group invariant functional relation among gauge and Yukawa couplings which holds beyond the unification point in Grand Unified Theories (GUTs). We present here various models where GYU is obtained by requiring the principles of finiteness and reduction of couplings. We examine the consequences of these requirements for the low energy parameter...
متن کاملUnification and Anti-unification modulo Equational Theories
Automated reasoning modulo an equational theory E is a fundamental technique in many applications. If E can be split as a disjoint union R ∪ Ax in such a way that R is a set of rewrite rules that are confluent, terminating, sort-decreasing, and coherent modulo a set of equational axioms Ax, it is well-known that narrowing with R modulo Ax provides a complete E-unification algorithm. However, na...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1975
ISSN: 0028-0836,1476-4687
DOI: 10.1038/253156d0